A perceptual hash function to store and retrieve large scale DNA sequences

نویسندگان

  • Jocelyn De Goer De Herve
  • Myoung-Ah Kang
  • Xavier Bailly
  • Engelbert Mephu Nguifo
چکیده

This BLOCKIN BLOCKIN paper BLOCKIN BLOCKIN proposes BLOCKIN BLOCKIN a BLOCKIN BLOCKIN novel BLOCKIN BLOCKIN approach BLOCKIN BLOCKIN for BLOCKIN BLOCKIN storing BLOCKIN BLOCKIN and BLOCKIN BLOCKIN retrieving BLOCKIN BLOCKIN massive BLOCKIN BLOCKIN DNA BLOCKIN BLOCKIN sequences. BLOCKIN BLOCKIN The method is based on a perceptual hash function, commonly used to determine the similarity between digital images that we adapted for DNA sequences. Perceptual hash function presented here is based on a Discrete Cosine Transform Sign Only (DCT-­‐SO). Each nucleotide is encoded as a fixed gray level intensity pixel and the hash is calculated from its significant frequency characteristics. This results to a drastic data reduction between the sequence and the perceptual hash. Unlike cryptographic hash functions, perceptual hashes are not affected by "avalanche effect" and thus can be compared. The similarity distance between two hashes is estimated BLOCKIN

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improved Hash Function Based on the Tillich-Zémor Hash Function

Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.

متن کامل

Image authentication using LBP-based perceptual image hashing

Feature extraction is a main step in all perceptual image hashing schemes in which robust features will led to better results in perceptual robustness. Simplicity, discriminative power, computational efficiency and robustness to illumination changes are counted as distinguished properties of Local Binary Pattern features. In this paper, we investigate the use of local binary patterns for percep...

متن کامل

Distributed Document Sharing with Text Classification over Content-Addressable Network

Content-addressable network is a scalable and robust distributed hash table providing distributed applications to store and retrieve information in an efficient manner. We consider design and implementation issues of a document sharing system over a content-addressable overlay network. Improvements and their applicability on a document sharing system are discussed. We describe our system protot...

متن کامل

SSAHA: a fast search method for large DNA databases.

We describe an algorithm, SSAHA (Sequence Search and Alignment by Hashing Algorithm), for performing fast searches on databases containing multiple gigabases of DNA. Sequences in the database are preprocessed by breaking them into consecutive k-tuples of k contiguous bases and then using a hash table to store the position of each occurrence of each k-tuple. Searching for a query sequence in the...

متن کامل

NoVoHT: a Lightweight Dynamic Persistent NoSQL Key/Value Store

With the increased scale of systems in use and the need to quickly store and retrieve information, key/value stores are becoming an important element in the design of large-scale storage systems. Key/value stores are well known for their simplistic interfaces, persistent nature, and excellent operational efficiency – they are also known as NoSQL databases. This paper presents the design and imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1412.5517  شماره 

صفحات  -

تاریخ انتشار 2014